A Flexible Scheduler for the Andorra-I System

A exible scheduler for distributing and-and or-parallel work in the Andorra-I system is presented. The scheduler allows workers to move freely between teams. Its strategy is based on estimates of and-and or-parallelism available in the execution tree. Preliminary results show that in most cases we can reach or surpass the best performance of Andorra-I running with any xed team connguration. Since the teams are conngured dynamically and automatically, the user does not need to be concerned with choosing an appropriate connguration. Further work is being done to improve the scheduler by using data obtained from compile-time analysis.